#include <iostream>

using namespace std;
typedef long long LL;
LL f[11][2023];
int main()
{
	f[0][0] = 1;
	for (int i = 1; i <= 2022; i++)
		for (int j = 0; j <= 10; j++)
			for (int k = 0; k <= 2022; k++)
				if (j >= 1 && k >= i) f[j][k] += f[j - 1][k - i];
	cout << f[10][2022] << endl;
	return 0;
}